Counting occurrences of 231 in an involution
نویسندگان
چکیده
منابع مشابه
Counting occurrences of 231 in an involution
We study the generating function for the number of involutions on n letters containing exactly r 0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r + 2. © 2006 Elsevier B.V. All rights reserved.
متن کاملCounting Occurrences of 3412 in an Involution
We study the generating function for the number of involutions on n letters containing exactly r ≥ 0 occurrences of 3412. It is shown that finding this function for a given r amounts to a routine check of all involutions on 2r + 1 letters. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 05C90
متن کاملCounting occurrences of 132 in an even permutation
We study the generating function for the number of even (or odd) permutations on n letters containing exactly r ≥ 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 05C90
متن کاملCounting Subwords Occurrences in Base-b Expansions
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the nonnegative integers. More precisely, we consider the sequence (Sb(n))n≥0 counting the number of positive entries on each row of a generalization of the Pascal triangle to binomial coefficients of base-b expansions. By using a convenient tree structure, we provide recurrence relations for (Sb(n))n≥0 le...
متن کاملCounting occurrences of some subword patterns
Counting the number of words which contain a set of given strings as substrings a certain number of times is a classical problem in combinatorics. This problem can, for example, be attacked using the transfer matrix method (see [20, Section 4.7]). In particular, it is a well-known fact that the generating function of such words is always rational. For example, in [20, Example 4.7.5] it is shown...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.01.011